Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions
نویسندگان
چکیده
For fixed t ≥ 2, we consider the class of representations of 1 as sum of unit fractions whose denominators are powers of t or equivalently the class of canonical compact t-ary Huffman codes or equivalently rooted t-ary plane “canonical” trees. We study the probabilistic behaviour of the height (limit distribution is shown to be normal), the number of distinct summands (normal distribution), the path length (normal distribution), the width (main term of the expectation and concentration property) and the number of leaves at maximum distance from the root (discrete distribution).
منابع مشابه
Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis
For fixed t ≥ 2, we consider the class of representations of 1 as sum of unit fractions whose denominators are powers of t or equivalently the class of canonical compact t-ary Huffman codes or equivalently rooted t-ary plane “canonical” trees. We study the probabilistic behaviour of the height (limit distribution is shown to be normal), the number of distinct summands (normal distribution), the...
متن کاملAsymptotic redundancy and prolixity
Gallager (1978) considered the worst-case redundancy of Huffman codes as the maximum probability tends to zero, showing that the limiting value is 1 − log2 e + log2 log2 e ≈ 0.08607. We ask similar questions for restricted classes of codes, such as ones corresponding to binary search trees.
متن کاملEvaluation of non-destructive Meyer method for determination of bark volume of beech (Fagus orientalis Lipsky) in different geographical aspects
The non-destructive Meyer method was evaluated to determine the bark volume of beech (Fagus orientalis Lipsky) stands in north of Iran. The sample size was 185 standing trees collected from 4 geographical aspects (north, south, west and east) aspects. The constant k values and bark thickness (2e mm) of 185 standing trees were used to calculate the bark volume by the Meyer method. In this study,...
متن کاملAverage Redundancy for Known Sources: Ubiquitous Trees in Source Coding∗
Analytic information theory aims at studying problems of information theory using analytic techniques of computer science and combinatorics. Following Hadamard’s precept, these problems are tackled by complex analysis methods such as generating functions, Mellin transform, Fourier series, saddle point method, analytic poissonization and depoissonization, and singularity analysis. This approach ...
متن کاملThe Construction of Huffman Codes is a Submodular ("Convex") Optimization Problem Over a Lattice of Binary Trees
We show that the space of all binary Huffman codes for a finite alphabet defines a lattice, ordered by the imbalance of the code trees. Representing code trees as path-length sequences, we show that the imbalance ordering is closely related to a majorization ordering on real-valued sequences that correspond to discrete probability density functions. Furthermore, this tree imbalance is a partial...
متن کامل